Minimal realizations of linear systems: The "shortest basis" approach

نویسنده

  • G. David Forney
چکیده

Given a discrete-time linear system C, a shortest basis for C is a set of linearly independent generators for C with the least possible lengths. A basis B is a shortest basis if and only if it has the predictable span property (i.e., has the predictable delay and degree properties, and is noncatastrophic), or alternatively if and only if it has the subsystem basis property (for any interval J , the generators in B whose span is in J is a basis for the subsystem CJ ). The dimensions of the minimal state spaces and minimal transition spaces of C are simply the numbers of generators in a shortest basis B that are active at any given state or symbol time, respectively. A minimal linear realization for C in controller canonical form follows directly from a shortest basis for C, and a minimal linear realization for C in observer canonical form follows directly from a shortest basis for the orthogonal system C. This approach seems conceptually simpler than that of classical minimal realization theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal solution of fuzzy linear systems

In this paper, we use parametric form of fuzzy number and we converta fuzzy linear system to two linear system in crisp case. Conditions for the existence of a minimal solution to $mtimes n$ fuzzy linear equation systems are derived and a numerical procedure for calculating the minimal solution is designed. Numerical examples are presented to illustrate the proposed method.

متن کامل

RAPPORT Realization by inspection

We investigate which rst-order representations can be obtained from high-order representations of linear systems`by inspection', that is just by rearrangement of the data. Under quite weak conditions it is possible to obtain minimal realizations in the so-called pencil form; under stronger conditions one can obtain minimal realizations in standard state space form by inspection. The development...

متن کامل

Square-Root Balancing and Computation of Minimal Realizations of Periodic Systems

We propose a numerically reliable approach for balancing and minimal realization of linear periodic systems with time-varying dimensions. The proposed approach to balancing belongs to the family of square-root methods with guaranteed enhanced computational accuracy and can be also used to compute balanced minimal order realizations from non-minimal ones. An alternative balancing-free square-roo...

متن کامل

Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form

A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...

متن کامل

A Derivation of the Minimal Polynomial Basis Approach to Linear Residual Generation

A fundamental part of a fault diagnosis system is the residual generator. Here a new method, the minimal polynomial basis approach, for design of residual generators for linear systems, is presented. The residual generation problem is transformed into a problem of finding polynomial bases for null-spaces of polynomial matrices. This is a standard problem in established linear systems theory, wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2011